A Generalization of the Regularization Proximal Point Method
نویسنده
چکیده
This paper deals with the generalized regularization proximal point method which was introduced by the authors in [Four parameter proximal point algorithms, Nonlinear Anal. 74 (2011), 544-555]. It is shown that sequences generated by it converge strongly under minimal assumptions on the control parameters involved. Thus the main result of this paper unify many results related to the prox-Tikhonov method, the contraction proximal point algorithm and/or the regularization method as well as some results of the above quoted paper.
منابع مشابه
A Generalized Proximal-Point Method for Convex Optimization Problems in Hilbert Spaces∗
We deal with a generalization of the proximal-point method and the closely related Tikhonov regularization method for convex optimization problems. The prime motivation behind this is the well-known connection between the classical proximal-point and augmented Lagrangian methods, and the emergence of modified augmented Lagrangian methods in recent years. Our discussion includes a formal proof o...
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملA Mathematical Analysis of New L-curve to Estimate the Parameters of Regularization in TSVD Method
A new technique to find the optimization parameter in TSVD regularization method is based on a curve which is drawn against the residual norm [5]. Since the TSVD regularization is a method with discrete regularization parameter, then the above-mentioned curve is also discrete. In this paper we present a mathematical analysis of this curve, showing that the curve has L-shaped path very similar t...
متن کاملFour parameter proximal point algorithms
Several strong convergence results involving two distinct four parameter proximal point algorithms are proved under different sets of assumptions on these parameters and the general condition that the error sequence converges to zero in norm. Thus our results address the two important problems related to the proximal point algorithm − one being of strong convergence (instead of weak convergence...
متن کاملRegularized Iterative Stochastic Approximation Methods for Variational Inequality Problems
We consider a Cartesian stochastic variational inequality problem with a monotone map. For this problem, we develop and analyze distributed iterative stochastic approximation algorithms. Such a problem arises, for example, as an equilibrium problem in monotone stochastic Nash games over continuous strategy sets. We introduce two classes of stochastic approximation methods, each of which require...
متن کامل